%ما هو (من)٪ 1 - تعريف

In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.

The rules can be expressed in English as:

• The negation of a disjunction is the conjunction of the negations
• The negation of a conjunction is the disjunction of the negations

or

• The complement of the union of two sets is the same as the intersection of their complements
• The complement of the intersection of two sets is the same as the union of their complements

or

• not (A or B) = (not A) and (not B)
• not (A and B) = (not A) or (not B)

where "A or B" is an "inclusive or" meaning at least one of A or B rather than an "exclusive or" that means exactly one of A or B.

In set theory and Boolean algebra, these are written formally as

${\displaystyle {\begin{aligned}{\overline {A\cup B}}&={\overline {A}}\cap {\overline {B}},\\{\overline {A\cap B}}&={\overline {A}}\cup {\overline {B}},\end{aligned}}}$

where

• ${\displaystyle A}$ and ${\displaystyle B}$ are sets,
• ${\displaystyle {\overline {A}}}$ is the complement of ${\displaystyle A}$,
• ${\displaystyle \cap }$ is the intersection, and
• ${\displaystyle \cup }$ is the union.

In formal language, the rules are written as

${\displaystyle \neg (P\lor Q)\iff (\neg P)\land (\neg Q),}$

and

${\displaystyle \neg (P\land Q)\iff (\neg P)\lor (\neg Q)}$

where

• P and Q are propositions,
• ${\displaystyle \neg }$ is the negation logic operator (NOT),
• ${\displaystyle \land }$ is the conjunction logic operator (AND),
• ${\displaystyle \lor }$ is the disjunction logic operator (OR),
• ${\displaystyle \iff }$ is a metalogical symbol meaning "can be replaced in a logical proof with", often read as "if and only if". For any combination of true/false values for P and Q, the left and right sides of the arrow will hold the same truth value after evaluation.

Applications of the rules include simplification of logical expressions in computer programs and digital circuit designs. De Morgan's laws are an example of a more general concept of mathematical duality.